<div class="problemindexholder" problemindex="A">
 <div class="ttypography">
  <div class="problem-statement">
   <div class="header">
    <div class="title">
     A. Fake NP
    </div>
    <div class="time-limit">
     <div class="property-title">
      time limit per test
     </div>
     1 second
    </div>
    <div class="memory-limit">
     <div class="property-title">
      memory limit per test
     </div>
     256 megabytes
    </div>
    <div class="input-file">
     <div class="property-title">
      input
     </div>
     standard input
    </div>
    <div class="output-file">
     <div class="property-title">
      output
     </div>
     standard output
    </div>
   </div>
   <div>
    <p>
     Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following problem instead of
     <span class="tex-font-style-it">
      longest-path
     </span>
     .
    </p>
    <p>
     You are given
     <span class="tex-span">
      <i>
       l
      </i>
     </span>
     and
     <span class="tex-span">
      <i>
       r
      </i>
     </span>
     . For all integers from
     <span class="tex-span">
      <i>
       l
      </i>
     </span>
     to
     <span class="tex-span">
      <i>
       r
      </i>
     </span>
     , inclusive, we wrote down all of their integer divisors except
     <span class="tex-span">
      1
     </span>
     . Find the integer that we wrote down the maximum number of times.
    </p>
    <p>
     Solve the problem to show that it's not a
     <span class="tex-font-style-it">
      NP
     </span>
     problem.
    </p>
   </div>
   <div class="input-specification">
    <div class="section-title">
     Input
    </div>
    <p>
     The first line contains two integers
     <span class="tex-span">
      <i>
       l
      </i>
     </span>
     and
     <span class="tex-span">
      <i>
       r
      </i>
     </span>
     (
     <span class="tex-span">
      2 ≤
      <i>
       l
      </i>
      ≤
      <i>
       r
      </i>
      ≤ 10
      <sup class="upper-index">
       9
      </sup>
     </span>
     ).
    </p>
   </div>
   <div class="output-specification">
    <div class="section-title">
     Output
    </div>
    <p>
     Print single integer, the integer that appears maximum number of times in the divisors.
    </p>
    <p>
     If there are multiple answers, print any of them.
    </p>
   </div>
   <div class="sample-tests">
    <div class="section-title">
     Examples
    </div>
    <div class="sample-test">
     <div class="input">
      <div class="title">
       Input
      </div>
      <pre>19 29<br/></pre>
     </div>
     <div class="output">
      <div class="title">
       Output
      </div>
      <pre>2<br/></pre>
     </div>
     <div class="input">
      <div class="title">
       Input
      </div>
      <pre>3 6<br/></pre>
     </div>
     <div class="output">
      <div class="title">
       Output
      </div>
      <pre>3<br/></pre>
     </div>
    </div>
   </div>
   <div class="note">
    <div class="section-title">
     Note
    </div>
    <p>
     Definition of a divisor:
     <a href="https://www.mathsisfun.com/definitions/divisor-of-an-integer-.html">
      https://www.mathsisfun.com/definitions/divisor-of-an-integer-.html
     </a>
    </p>
    <p>
     The first example: from
     <span class="tex-span">
      19
     </span>
     to
     <span class="tex-span">
      29
     </span>
     these numbers are divisible by
     <span class="tex-span">
      2
     </span>
     :
     <span class="tex-span">
      {20, 22, 24, 26, 28}
     </span>
     .
    </p>
    <p>
     The second example: from
     <span class="tex-span">
      3
     </span>
     to
     <span class="tex-span">
      6
     </span>
     these numbers are divisible by
     <span class="tex-span">
      3
     </span>
     :
     <span class="tex-span">
      {3, 6}
     </span>
     .
    </p>
   </div>
  </div>
  <p>
  </p>
 </div>
</div>
